The letters of the word ASSASSIN are written | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(B) The word $ASSASSIN$ contains $8$ letters: $A(2), S(4), I(1), N(1)$.Total number of arrangements $ = \frac{8!}{2!4!1!1!} = \frac{40320}{2 	imes 24

Vedclass · Accepted Answer

$\frac{1}{14}$

Vedclass · Answer

(B) The word $ASSASSIN$ contains $8$ letters: $A(2), S(4), I(1), N(1)$.Total number of arrangements $ = \frac{8!}{2!4!1!1!} = \frac{40320}{2 	imes 24} = 840$.To ensure no two $S$ occur together,we first arrange the remaining letters $A, A, I, N$. The number of ways to arrange these $4$ letters is $\frac{4!}{2!} = 12$.These $4$ letters create $5$ gaps (including ends): $\_ L_1 \_ L_2 \_ L_3 \_ L_4 \_$.We need to place $4$ $S$'s in these $5$ gaps. The number of ways to choose $4$ gaps out of $5$ is $\binom{5}{4} = 5$.Favorable arrangements $ = 12 	imes 5 = 60$.Required probability $ = \frac{60}{840} = \frac{1}{14}$.

The letters of the word $ASSASSIN$ are written down at random in a row. The probability that no two $S$ occur together is

Similar Questions

How many times does the digit $5$ appear when writing natural numbers from $1$ to $100$?

If $f(n) = n! (31-n)!$,where $n \in \{0, 1, 2, \ldots, 31\}$,then the minimum value of $f(n)$ is

In an examination,a student has to write exams in $8$ different subjects. He is declared fail if he fails in at least one subject. The number of ways in which he can fail is

$^{80}C_{40}$ is not divisible by -

The remainder obtained when $1! + 2! + 3! + \dots + 11!$ is divided by $12$ is

Vedclass Test Series

Exam Paper Generator

Online Exam Module